Residual smallness relativized to congruence types, I
نویسندگان
چکیده
منابع مشابه
Residual Smallness and Weak Centrality
We develop a method of creating skew congruences on subpowers of finite algebras using groups of twin polynomials, and apply it to the investigation of residually small varieties generated by nilpotent algebras. We prove that a residually small variety generated by a finite nilpotent (in particular, a solvable Eminimal) algebra is weakly abelian. Conversely, we show in two special cases that a ...
متن کاملA Geometric Consequence of Residual Smallness
We describe a new way to construct large subdirectly irreducibles within an equational class of algebras. We use this construction to show that there are forbidden geometries of multitraces for finite algebras in residually small equational classes. The construction is first applied to show that minimal equational classes generated by simple algebras of types 2, 3 or 4 are residually small if a...
متن کاملCongruence Types
We introduce a type theoretical framework in which canon ical term rewriting systems can be represented faithfully both from the logical and the computational points of view The framework is based on congruence types a new syntax which combines inductive algebraic and quotient types Congruence types improve on existing work to combine type theories with algebraic rewriting by making explicit th...
متن کامل: examining l2 teachers’ corrective feedback types in relation to learners’ uptake, proficiency levels, and context types
abstract this study investigates the teachers’ correction of students’ spoken errors of linguistic forms in efl classes, aiming at (a) examining the relationship between the learners’ proficiency level and the provision of corrective feedback types, (b) exploring the extent to which teachers’ use of different corrective feedback types is related to the immediate types of context in which err...
Relativized codes
A code C over an alphabet Σ is a set of words such that every word in C+ has a unique factorization over C, that is, a unique C-decoding. When not all words in C+ appear as messages, a weaker notion of unique factorization can be used. Thus we consider codes C relative to a given set of messages L, such that each word in L has a unique C-decoding. We extend this idea of relativizing code concep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2001
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(01)00027-5